Combinatorial results on directed hypergraphs for the SAT problem

Combinatorial results on directed hypergraphs for the SAT proble

A Generalised Network Flow Approach to Combinatorial Auctions

International audienceIn this paper we address the problem of (1) representing bids for combinatorial auctions and (2) employing those structures for "reasoning". We propose a graph-based language who's novelty lies (1) in the use of generalized network flows to represent the bids and (2) in the interpretation of winner determination as an adequate aggregation of individual preferences. We motivate the language both from representational and reasoning points of view and show how our language represents the same class of expressivity of bids more concisely compared to existing work

Representing Multi-Scale Datalog +/- Using Hierarchical Graphs

International audienceWe introduce a multi scale knowledge representation and reasoning formalism of Datalog+/− knowledge bases. This is defined on a novel graph transformation system that highlights a new type of rendering based on the additional expansion of relation nodes. Querying and integration capabilities of our approach are based on a FOL sound and complete homomorphism

Graph Coloring using Peer-to-Peer Networks

The popularity of distributed file systems continues to grow in last years. The reasons they are preferred over traditional centralized systems include fault tolerance, availability, scalability and performance. In this paper, we propose a framework for analyzing peer-to-peer content distributed technologies and their applications in the cooperative solving of combinatorial optimization problems. Our approach, which follows the Content Addressable Network model, is scalable, fault-tolerant and self-organizing; we improved also load distribution at the insertion and deletion of nodes. We use this network for the classical ”graph coloring” problem, in order to reduce the computational time for its cooperative solving